cutting-stock problem meaning in Chinese
切段问题
Examples
- The paper based on the idea of k - opt algorithm for tsp , present a swap algorithm for the one - dimensional cutting - stock problem
摘要根据旅行商问题( tsp )的邻域搜索算法的思想，提出了型材下料问题的一种优化算法。 - Then , the cutting - stock technology in the product design system oriented to the optimized utilization of material resource is deeply studied . in this paper , the mathematics model of two - dimensional guillotine cutting - stock problem based on inventory is set up . to solve the mathematics model above , the iterative solving method through wiping off worse layout is put forward ; on the base of the column generation formulas that are deduced to solve multi - material two - dimensional guillotine cutting - stock model ， the column generation algorithm is brought forward by using column generation technology ; the solution of two - dimensional knapsack problem and one - dimensional knapsack problem is studied ; the concept of the value of
给出了基于库存的二维guillotine优化下料问题的数学模型，提出了一种新的求解方法? ?去差迭代求解法；引入了列生成技术，在推导多原材二维guillotine优化下料模型求解的列生成数学形式的基础上，给出了列生成迭代求解算法，研究并分析了二维背包问题和一维背包问题的求解算法；提出了板材排样价值概念，建立了板材排样价值的估计方法；论文同时针对优化下料技术当前应用中存在的问题，提出了一种基于asp （ applicationservicesprovider ）模式的多软件协同优化下料解决方法并给出了该方法基于agent思想的具体实现技术。